Hunting rabbits on the hypercube

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Walks on the Hypercube

Recently, it has been shown that one-dimensional quantum walks can mix more quickly than classical random walks, suggesting that quantum Monte Carlo algorithms can outperform their classical counterparts. We study two quantum walks on the n-dimensional hypercube, one in discrete time and one in continuous time. In both cases we show that the quantum walk mixes in (π/4)n steps, faster than the Θ...

متن کامل

Quantum Mechanics on the Hypercube

We construct quantum evolution operators on the space of states, that is represented by the vertices of the n-dimensional unit hypercube. They realize the metaplectic representation of the modular group SL(2,Z2n). By construction this representation acts in a natural way on the coordinates of the non-commutative 2torus, T2 and thus is relevant for noncommutative field theories as well as theori...

متن کامل

Randomized Selection on the Hypercube

In this paper we present randomized algorithms for selection on the hypercube. We identify two variants of the hypercube namely, the sequential model and the parallel model. In the sequential model, any node at any time can handle only communication along a single incident edge, whereas in the parallel model a node can communicate along all its incident edges at the same time. We specify three ...

متن کامل

Fourier Transform on the Hypercube

Definitions Let F be the real vector space of real functions on 2 [n] (the set of subsets of [n] = {1,. .. , n}). Define an inner product on F by f, g = 1 2 n A⊆[n] f (A)g(A). For S ⊆ [n], let x S ∈ F be the function x S (A) = (−1) |A∩S|. Now we compute x S , x T = 1 2 n A⊆[n]

متن کامل

LSH on the Hypercube Revisited

LSH (locality sensitive hashing) had emerged as a powerful technique in nearest-neighbor search in high dimensions [IM98, HIM12]. Given a point set P in a metric space, and given parameters r and ε > 0, the task is to preprocess the point set, such that given a query point q, one can quickly decide if q is in distance at most ≤ r or ≥ (1+ε)r from the query point. Once such a near-neighbor data-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2019

ISSN: 0012-365X

DOI: 10.1016/j.disc.2018.10.011